Rational Erd} Os Numbers

نویسنده

  • Michael Barr
چکیده

The concept of Erd} os number is well known among mathematicians and somewhat known more generally (see, for example, de Castro & Grossman, 1999] or the web site Paul Erd} os, who died in late 1996, was a mathematician who was author or coauthor|most often the latter|of nearly 1500 papers and had nearly 500 coauthors. By deenition, Erd} os had Erd} os number zero, his collaborators had Erd} os number one, a person who not collaborated with Erd} os, but had collaborated with one of his collaborators has Erd} os number two and so on. For example, I have written a joint paper with Michael Makkai, who has a joint paper with Erd} os and so Makkai has Erd} os number one and mine is two. But there is something not entirely rational about this assignment of numbers. Surely a person who has written, say, ve joint papers with Erd} os is more closely associated with Erd} os than someone who has written only one and therefore ought to have a smaller Erd} os number. In fact, it seems entirely reasonable that such a person be assigned the Erd} os number 1=5. If a person has written two joint papers with someone whose Erd} os number is 1, then his Erd} os number ought to be 3/2. If you have written two joint papers with someone who has written three joint papers with Erd} os, then your Erd} os number should be 5/6 and so on. But what if you have written two joint papers with one Erd} os coauthor and three with someone whose Erd} os number is 2? This leads to an obvious iteration procedure for calculating these new,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

0 Ju l 2 00 1 Multivariate Diophantine equations with many solutions

Among other things we show that for each n-tuple of positive rational numbers (a 1 ,. .. , a n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a 1 x 1 +· · ·+a n x n = 1 with x 1 ,. .. , x n S-units are not contained in fewer than exp((4 + o(1))s 1/2 (log s) −1/2) proper linear subspaces of C n. This generalizes a result of Erd˝ os, Stewart...

متن کامل

Abc Allows Us to Count Squarefrees

We show several consequences of the abc-conjecture for questions in analytic number theory which were of interest to Paul Erd} os: For any given polynomial f(x) 2 Zx], we deduce, from the abc-conjecture, an asymptotic estimate for the frequency with which f(n) is squarefree, when n is an integer (and also deduce such estimates for binary homogenous forms). Amongst several applications of this r...

متن کامل

Some Methods of Erdős Applied to Finite Arithmetic Progressions

Since 1934 Erd} os has introduced various methods to derive arithmetic properties of blocks of consecutive integers. This research culminated in 1975 when Erd} os and Selfridge ES] established the old conjecture that the product of two or more consecutive positive integers is never a perfect power. It is very likely that the product of the terms of a nite arithmetic progression of length at lea...

متن کامل

The Elementary Proof of the Prime Number Theorem

P rime numbers are the atoms of our mathematical universe. Euclid showed that there are infinitely many primes, but the subtleties of their distribution continue to fascinate mathematicians. Letting p(n) denote the number of primes p B n, Gauss conjectured in the early nineteenth century that pðnÞ#n=lnðnÞ. In 1896, this conjecture was proven independently by Jacques Hadamard and Charles de la V...

متن کامل

An Erd os-Gallai Theorem For Matroids

Erd os and Gallai showed that for any simple graph with n vertices and circumference c it holds that |E(G)| ≤ 2 (n−1)c.We extend this theorem to simple binary matroids having no F7-minor by showing that for such a matroid M with circumference c(M)≥ 3 it holds that |E(M)| ≤ 1 2 r(M)c(M). Mathematics Subject Classi cation (2000). Primary 05D15; Secondary 05B35.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001